Speeding up circularity tests for attribute grammars

Speeding Up Parallelism Detection for Attribute Grammars

Attribute Grammars

Attribute grammars are a framework for defining semantics of programming languages in a syntax-directed fashion. In this paper, we define attribute grammars, and then illustrate their use for language definition, compiler generation, definite clause grammars, design and specification of algorithms, etc. Our goal is to emphasize its role as a tool for design, formal specification and implementat...

Strictness Analysis for Attribute Grammars

Attribute grammars may be seen as a (rather specialised) lazy or demand-driven programming language. The “programs” in this language take text or parse trees as input and return values of the synthesised attributes to the root as output. From this observation we establish a framework for abstract interpretation of attribute grammars. The framework is used to construct a strictness analysis for ...

Dynamic Attribute Grammars Dynamic Attribute Grammars Les Grammaires Attribuues Dynamiques

Although Attribute Grammars were introduced long ago, their lack of expressive-ness has resulted in limited use outside the domain of static language processing. With the new notion of Dynamic Attribute Grammars deened on top of Grammar Couples, informally presented in a previous paper, we show that it is possible to extend this expressiveness and to describe computations on structures that are...

On Exponential - Time Completeness of the Circularity Problem for Attribute

Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata theory, such as writing pushdown acceptor and alternating Turing machines. They reduced the acceptance problems of above automata, which are exponential-time (EXPTIME) complete, to the AG circularity problem. These pr...